Compositional Performance Reasoning
نویسنده
چکیده
A well-understood reason for component-based software engineering (CBSE) is improved productivity. CBSE is also important for another basic reason. It enables compositional or modular reasoning, and therefore, it facilitates production of high quality systems. In compositional reasoning, it is possible to reason about the behavior of the system using the behavioral specifications of reused components ignoring their internal details. Compositionality is essential for a reasoning process – formal or informal – to scale up. Formal techniques for reasoning typically concentrate on functional behavior, though predictable component-based software engineering demands predictability in both functional and performance behavior. Compositional analysis of time and space for component-based software is the focus of this paper. The paper discusses a variety of issues in compositional performance specification and reasoning, including the impact of abstraction, precision, and parameterization. The problems are so basic that there are unresolved research issues to be tackled even for the simplest reusable components.
منابع مشابه
Expressiveness Issues in Compositional Performance Reasoning
Compositional reasoning about any behavioral property of a system depends, first, on the ability to express that property for both individual components and systems constructed from them. Expressiveness problems arise when considering compositional reasoning about performance in the presence of complex user-defined types (as opposed to simpler built-in types). There are interesting implications...
متن کاملCompositional Metric Reasoning with Probabilistic Process Calculi
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the ...
متن کاملCompositional bisimulation metric reasoning with Probabilistic Process Calculi
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the ...
متن کاملA Survey on Compositional Veri cation
In this survey, we overview several compositional veriication approaches based on model checking, namely compositional minimization, classic assume guarantee reasoning and circular reasoning. We describe details of each of these approaches, and elaborate the general problems with some proposed solutions. We also summarize the advantages and disadvantages of each. In the last section, we give a ...
متن کاملCompositional Reasoning for Hardware/Software Co-verification
In this paper, we present and illustrate an approach to compositional reasoning for hardware/software co-verification of embedded systems. The major challenges in compositional reasoning for co-verification include: (1) the hardware/software semantic gaps, (2) lack of common property specification languages for hardware and software, and (3) lack of compositional reasoning rules that are applic...
متن کامل